A Reliable Content-Based Routing Protocol over Structured Peer-to-Peer Networks
نویسندگان
چکیده
Much work has been done on building content-based publish/subscribe systems over structured P2P networks, so that the two technologies can be combined together to better support large-scale and highly dynamic systems. However, existing content-based routing protocols can only provide weak reliability guarantee over structured P2P networks. We designed a new type of content-based routing protocol over structured P2P networks — Identifier Range Based Routing (IRBR) protocol, which organizes subscriptions on the basis of the identifier range of subscribers. It provides strong reliability guarantee and is more efficient in event delivery. Experimental results demonstrate the routing efficiency of the protocol.
منابع مشابه
TAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملMULTI+: Building Topology-Aware Overlay Multicast Trees
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper we present MULTI+, an application-level multicast protocol for content distribution over a peer-to-peer (P2P) TOPLUS-based network. We use the characteristics of TOPLUS to design a protocol that allows for every peer to connect to an...
متن کاملInvestigation of Chord Protocol in Peer to Peer-Wireless Mesh Network with Mobility
File sharing in networks is generally achieved using Peer-to-Peer (P2P) applications. Structured P2P approaches are widely used in adhoc networks due to its distributed and scalability features. Efficient mechanisms are required to handle the huge amount of data distributed to all peers. The intrinsic characteristics of P2P system makes for easier content distribution when compared to client-se...
متن کاملDistributed Lookup in Structured Peer-to-Peer Ad-Hoc Networks
Various peer-to-peer (P2P) architectures for ad-hoc networks have been proposed over the last few years. Most of them are unstructured and use some form of flooding to locate content, because the physical constraints of the underlying network make the construction of arbitrary application-layer overlays impractical. In this paper, we study the problem of applying distributed hash tables (DHT) t...
متن کاملSecure Reputation Mechanism For Unstructured Peer To Peer System
Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We address both of these problems through replica placement. In its simplest form, a peer-topeer network is created when two or more PCs are conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004